Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
نویسندگان
چکیده
We describe a category of Feynman graphs and show how it relates to compact symmetric multicategories (coloured modular operads) just as linear orders relate to categories and rooted trees relate to multicategories. More specifically we obtain the following nerve theorem: compact symmetric multicategories can be characterised as presheaves on the category of Feynman graphs subject to a Segal condition. This text is a write-up of the second-named author’s QPL6 talk; a more detailed account of this material will appear elsewhere [9].
منابع مشابه
Rank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract)
We prove that every infinite sequence of skew-symmetric or symmetric matrices M1, M2, . . . over a fixed finite field must have a pair Mi, Mj (i < j) such that Mi is isomorphic to a principal submatrix of the Schur complement of a nonsingular principal submatrix in Mj , if those matrices have bounded rank-width. This generalizes three theorems on well-quasi-ordering of graphs or matroids admitt...
متن کاملA Model Category Structure on the Category of Simplicial Multicategories
We establish a Quillen model structure on simplicial (symmetric) multicategories. It extends the model structure on simplicial categories due to J. Bergner [2]. We observe that our technique of proof enables us to prove a similar result for (symmetric) multicategories enriched over other monoidal model categories than simplicial sets. Examples include small categories, simplicial abelian groups...
متن کاملWeak n-categories: comparing opetopic foundations
We define the category of tidy symmetric multicategories. We construct for each tidy symmetric multicategory Q a cartesian monad (EQ, TQ) and extend this assignation to a functor. We exhibit a relationship between the slice construction on symmetric multicategories, and the ‘free operad’ monad construction on suitable monads. We use this to give an explicit description of the relationship betwe...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 270 شماره
صفحات -
تاریخ انتشار 2011